The Correlation Coefficient Technique for Pattern Matching
نویسندگان
چکیده
Introduction: The ability to track motion is essential for many MRI applications. Specific applications of interest in our lab include retrospective and prospective 2D navigator echo motion artifact correction as well as post-process image averaging[l]. Previous attempts at motion tracking can be broadly classified into: 1) phase-based subtraction or 2) image-based pattern matching techniques. Pattern matching attempts to follow a region of anatomy through a series of images by finding the location in each image that best matches a pre-selected pattern containing the anatomy of interest. An advantage of pattern matching is that it is less sensitive to spurious phase that may arise from a variety of sources in MRI. Additionally, even if non-rigid body motion is present (e.g. in the heart), pattern matching may still be used to follow a local region of the anatomy. The major disadvantage of current pattern matching techniques is that they frequently fail if there are large interor intra-image intensity variations. Such a situation is encountered, for example, with flowing blood in the heart. In this abstract, the correlation-coefficient pattern matching technique is discussed. This technique is completely insensitive to image intensity variations. Additionally, it can be performed extremely rapidly, thus making it useful for techniques such as prospective navigation. Theory: Previous pattern matching techniques have used least squares[2] (LS) and/or cross-correlation[l,2] (XC) as the matching procedure. The LS technique finds the location (to, ~0)) in the image, that minimizes the least-square distance between the object (f(z, y)) and the MxN pattern (h(z, y)):
منابع مشابه
Pattern Correlation and Mismatch in Two-element Antenna Arrays
In an antenna array the element pattern correlation and the array matching depend on each other. For lossless two-element arrays the general formulation of the dependency of array matching on pattern correlation is given and solved numerically for some basic cases. Array matching is given as a characteristic mismatch coefficient and as the mean relative reflected power.
متن کاملRotation Invariant Template Matching
In rotation invariant template matching one wants to find finding from the given input image the locations that are similar to the given pattern template, so that the pattern may have any orientation. Template matching is an old but important problem in computer vision and pattern recognition, and thus there have also been many attempts to solve it. Most of the most succesful solutions so far c...
متن کاملUsing the ENF Criterion for Determining the Time of Recording of Short Digital Audio Recordings
The Electric Network Frequency (ENF) Criterion is a recently developed forensic technique for determining the time of recording of digital audio recordings, by matching the ENF pattern from a questioned recording with an ENF pattern database. In this paper we discuss its inherent limitations in the case of short – i.e., less than 10 minutes in duration – digital audio recordings. We also presen...
متن کاملFast Template Matching
Although it is well known that cross correlation can be efficiently implemented in the transform domain, the normalized form of cross correlation preferred for template matching applications does not have a simple frequency domain expression. Normalized cross correlation is usually computed in the spatial domain for this reason. This short paper shows that unnormalized cross correlation can be ...
متن کاملEvaluation of Similarity Measures for Template Matching
Image matching is a critical process in various photogrammetry, computer vision and remote sensing applications such as image registration, 3D model reconstruction, change detection, image fusion, pattern recognition, autonomous navigation, and digital elevation model (DEM) generation and orientation. The primary goal of the image matching process is to establish the correspondence between two ...
متن کامل